Quantum measurements and the Abelian Stabilizer Problem
نویسنده
چکیده
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results 7]. Our method is based on a procedure for measuring an eigenvalue of a unitary operator. Another application of this procedure is a polynomial quantum Fourier transform algorithm for an arbitrary nite Abelian group. The paper also contains a rather detailed introduction to the theory of quantum computation.
منابع مشابه
Classical simulations of Abelian-group normalizer circuits with intermediate measurements
Quantum normalizer circuits were recently introduced as generalizations of Clifford circuits [1]: a normalizer circuit over a finite Abelian group G is composed of the quantum Fourier transform (QFT) over G, together with gates which compute quadratic functions and automorphisms. In [1] it was shown that every normalizer circuit can be simulated efficiently classically. This result provides a n...
متن کاملAbelian Hypergroups and Quantum Computation
Motivated by a connection, described here for the first time, between the hidden normal subgroup problem (HNSP) and abelian hypergroups (algebraic objects that model collisions of physical particles), we develop a stabilizer formalism using abelian hypergroups and an associated classical simulation theorem (a la Gottesman-Knill). Using these tools, we develop the first provably efficient quantu...
متن کاملNormalizer Circuits and Quantum Computation
In this thesis, we introduce new models of quantum computation to study the potential and limitations of quantum computer algorithms. Our models are based on algebraic extensions of the qubit Clifford gates (CNOT, Hadamard and π/4-phase gates) and Gottesman’s stabilizer formalism of quantum codes. We give two main kinds of technical contributions with applications in quantum algorithm design, c...
متن کاملQuantum Error-Correction Codes on Abelian Groups
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
متن کاملThe computational power of normalizer circuits over black-box groups
This work presents a precise connection between Clifford circuits, Shor’s factoring algorithm and several other famous quantum algorithms with exponential quantum speed-ups for solving Abelian hidden subgroup problems. We show that all these different forms of quantum computation belong to a common new restricted model of quantum operations that we call black-box normalizer circuits. To define ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 3 شماره
صفحات -
تاریخ انتشار 1996